Type-checking in Formally Non-typed Systems
نویسندگان
چکیده
Type checking defines and constrains system output and intermediate representations. We report on the advantages of introducing multiple levels of type checking in deep parsing systems, even with untyped formalisms.
منابع مشابه
Model Checking Auctions as Artifact Systems: Decidability via Finite Abstraction
The formal verification of auctions has recently received considerable attention in the AI and logic community. We tackle this problem by adopting methodologies and techniques originally developed for Artifact Systems, a novel paradigm in Service Oriented Computing. Specifically, we introduce a typed version of artifactcentric multi-agent systems (AC-MAS), a multi-agent setting for Artifact Sys...
متن کاملA Declarative Semantics for Typed Logic Programs
Many typed (sorted) logic programming languages are based on sorted logics in which there is typically a set of well-sortedness rules in addition to the ordinary well-formedness rules. An advantage of this approach is that type checking is typically decidable. However such an approach restricts the expressiveness of typed logic programming language. On the other hand, there is another approach ...
متن کاملTypability and Type Checking in the Second-Order -Calculus Are Equivalent and Undecidable
Girard and Reynolds independently invented the second-order polymorphically typed lambda calculus, known as System F, to handle problems in logic and computer programming language design, respectively. Viewing F in the Curry style, which associates types with untyped lambda terms, raises the questions of typability and type checking. Typability asks for a term whether there exists some type it ...
متن کاملAn Algorithm for Checking the Disjointness of Types
We describe an algorithm approximating the following question: Given two types t1 and t2, are there instances (t1) and (t2) denoting a common element? By answering this question we solve a main problem towards a type checking algorithm for non-disjoint types that raises an error just for function calls that cannot be executed successfully for any input arguments. For dynamically typed functiona...
متن کاملAdditional Material for “Unifying Data Representation Transformations”
This report shows an end-to-end formalization of the data representation transformation mechanism in the “Unifying Data Representation Transformations” paper [16]. Since the mechanism described in the paper is targeted at the Scala programming language and the specification is written against System F<: with local colored type inference [11, 14] formally reasoning about the calculus is a major ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2008